Composite finite field multiplier

ABSTRACT

A composite finite field multiplier is disclosed. The multiplier includes a controller, an input port, an output port, a GF((2 n ) 2 ) multiplier, a GF(2 n ) standard basis multiplier, and a GF(2 n ) look-up table multiplier; the controller is connected respectively to the input port, the output port, the GF((2 n ) 2 ) multiplier, the GF(2 n ) standard basis multiplier and the GF(2 n ) look-up table multiplier; the GF((2 n ) 2 ) multiplier is connected respectively to the GF(2 n ) standard basis multiplier and the GF(2 n ) look-up table multiplier. By using the GF((2 n ) 2 ) multiplier, the GF(2 n ) standard basis multiplier and the GF(2 n ) look-up table multiplier, the multiplication of three operands is realized. Compared with the existing multiplier, the multiplier of the present invention has significant advantages in the speed of multiplying three operands over GF((2 n ) m ).

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a national stage entry of PCT/CN2012/076053, filed May 25, 2012, which published as WO 2013/034000 on Mar. 14, 2013 in a language other than English, which claims the benefit of CN Application No. CN 201110267272.4, filed Sep. 9, 2011.

FIELD OF THE INVENTION

The present invention relates generally to a device for multiplying elements of a composite finite field, and more particularly to a multiplier for multiplying three operands of a composite finite field.

BACKGROUND OF THE INVENTION

A finite field is a field containing only a finite number of elements, which is widely used in various engineering fields. At present, based on different design basis, multiplication over a finite field are mainly divided into four types: multiplication on the standard basis, multiplication on normal basis, multiplication on double basis, and multiplication on triangular basis.

A composite finite field is a special form of the finite field, and the composite finite field GF((2^(n))^(m)) is the isomorphic form of the finite field GF(2^(n×m)), which is effectively used in various cryptographic applications and encoding techniques. Effective multiplication design over the composite finite field plays a vital role in the implementation of cryptographic algorithms. There are a variety of known multipliers over composite finite fields in prior art, including software multiplier and hardware multiplier, both of which are devices for performing multiplication of two operands.

The multiplication of three operands is widely used in solving mathematical problems and engineering fields, for example, solving of the Oil and Vinegar polynomial which is commonly used in the cryptographic field. The structure of the Oil and Vinegar polynomial includes a plurality of multiplications of three operands as follows:

${\sum\limits_{{i \in O_{l}},{j \in S_{l}}}{\alpha_{ij}x_{i}x_{j}}} + {\sum\limits_{i,{j \in S_{l}}}{\beta_{ij}x_{i}x_{j}}} + {\sum\limits_{i \in S_{l + 1}}{\gamma_{i}x_{i}}} + {\eta.}$

The Oil and Vinegar polynomial is the most common form of polynomial in multivariate public key cryptosystem. Each individual element of this polynomial is an element of the computing domain. When calculating the value of the Oil and Vinegar polynomial, especially the first two terms of α_(ij)x_(i)x_(j) and β_(ij)x_(i)x_(j), the multiplication of three operands may be used for many times. The multiplication of three operands is not limited to this.

The existing techniques for solving the multiplication of three operands are realized by multipliers of two operands. However, under real-time and speed-sensitive circumstances, there is a need to use specific hardware devices to implement multiplication of three operands.

SUMMARY OF THE INVENTION

Therefore, in order to address the deficiencies and inadequacies in the art, the present invention aims to provide a high-speed composite finite field multiplier for multiplying three operands.

The object of the invention is achieved by the following technical solutions.

A composite finite field multiplier, including:

an input port, configured to input an operand a(x), an operand b(x), an operand c(x), an irreducible polynomial p(x) selected over the GF(2^(n)) field, an irreducible polynomial q(x) selected over the GF((2^(n))^(m)) field and a control signal k;

a GF(2^(n)) standard basis multiplier, configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) on the standard basis over GF(2^(n));

a GF(2^(n)) look-up table multiplier, configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) based on the look-up table over GF(2^(n));

a GF((2^(n))²) multiplier, including a first processor and a scheduler interconnected with each other; the first processor is configured to implement the multiplication (a(x)×b(x)×c(x))mod(q(x)) of the three operands a(x), b(x) and c(x) over GF((2^(n))²), wherein “mod” represents modular operation; the scheduler is configured to call the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier;

a controller, configured to control the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier;

an output port, configured to output the results;

the controller is connected respectively to the input port, the output port, the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier;

the GF((2^(n))²) multiplier is connected respectively to the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier.

The first processor includes an XOR gate circuit for processing the addition operation over the GF(2^(n)) field.

The control signal k is a (2-bit) value, and has four types of binary value, i.e. (00)₂, (01)₂, (10)₂ and (11)₂.

The controller includes a parser and a second processor interconnected with each other;

the parser is configured to parse the inputted control signal;

the second processor is configured to receive the data signal from the input port, and, according to a parsing result from the parser, to notify the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier to perform a function corresponding to the parsing result.

The operand a(x), operand b(x) and operand c(x) are in the following forms: a(x)=a _(n-1) x ^(n-1) +a _(n-2) x ^(n-2) + . . . +a ₀; b(x)=b _(n-1) x ^(n-1) +b _(n-2) x ^(n-2) + . . . +b ₀; c(x)=c _(n-1) x ^(n-1) +c _(n-2) x ^(n-2) + . . . +c ₀.

The irreducible polynomial p(x) selected over the GF(2^(n)) field is in the following form: p(x)=x ^(n) +p _(n-1) x ^(n-1) +p _(n-2) x ^(n-2) + . . . +p ₁ x+1;

The irreducible polynomial q(x) selected over the GF((2^(n))^(m)) field is in the following form: q(x)=q _(m) x ^(m) +q _(m-1) x ^(m-1) + . . . +q ₀;

Compared with the prior art, the present invention has the following advantages and technical effects.

By using the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier, the multiplication of three operands is realized. Compared with the existing multiplier, the multiplier of the present invention has significant advantages in the speed of multiplying three operands over GF((2^(n))^(m)), and thus can be widely used in various engineering fields, especially in hardware implementation of cryptographic algorithms and in solving various mathematical problems.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic structure chart of the composite finite field multiplier in one embodiment of the present invention;

FIG. 2 is a schematic structure chart of the controller in one embodiment of the present invention;

FIG. 3 is a schematic structure chart of the GF((2^(n))²) multiplier in one embodiment of the present invention;

FIG. 4 is a schematic structure chart of the GF(2^(n)) standard basis multiplier in one embodiment of the present invention;

FIG. 5 is a schematic structure chart of the GF(2^(n)) look-up table multiplier in one embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The invention will be better understood with reference to the following description taken in conjunction with the specific embodiments and the accompanying drawings. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description and the exemplary embodiments described therein.

EXAMPLES

As illustrated in FIG. 1, the composite finite field multiplier of the present invention includes a controller, input ports, an output port, a GF((2^(n))²) multiplier, a GF(2^(n)) standard basis multiplier and a GF(2^(n)) look-up table multiplier; the controller is connected respectively to the input ports, the output port, the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier; the GF((2^(n))²) multiplier is connected respectively to the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier.

Following is a detailed description of the components of the multiplier of the present invention.

(1) The input ports: as illustrated in FIG. 1, there are six input ports in the embodiment of the invention, including five input ports for inputting data signal and one for control signal, wherein the input ports a, b and c are configured respectively to input three operands a(x), b(x) and c(x); the input ports p and q are configured respectively to input the irreducible polynomial p(x) and q(x) selected over GF(2^(n)) and GF((2^(n))^(m)); and the input port k is configured to input a control signal.

a(x), b(x), c(x), p(x) and q(x) are in the following forms: a(x)=a _(n-1) x ^(n-1) +a _(n-2) x ^(n-2) + . . . +a ₀; b(x)=b _(n-1) x ^(n-1) +b _(n-2) x ^(n-2) + . . . +b ₀; c(x)=c _(n-1) x ^(n-1) +c _(n-2) x ^(n-2) + . . . +c ₀; p(x)=x ^(n) +p _(n-1) x ^(n-1) +p _(n-2) x ^(n-2) + . . . +p ₁ x+1; q(x)=q _(m) x ^(m) +q _(m-1) x ^(m-1) + . . . +q ₀;

wherein q_(m), q_(m-1), . . . , q₀ are elements of GF(2^(n)), and a_(m-1), a_(m-2), . . . , a₀, b_(m-1), b_(m-2), . . . , b₀, c_(m-1), c_(m-2), . . . , c₀, and p_(n-1), p_(n-2), . . . , p₁ are elements of GF(2).

The control signal k is a (2-bit) value, which has four types of binary value, i.e. (00)₂, (01)₂, (10)₂ and (11)₂.

(2) The output port: as illustrated in FIG. 1, the output port d is configured to output the calculation results d(x) obtained by solving the expression (a(x)×b(x)×c(x))mod(q(x)), wherein mod represents modular operation;

(3) The controller: as the only component that can communicate with I/O port, the controller is a core component of the multiplier of the present invention, which can control the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier.

As illustrated in FIG. 2, the controller includes a parser and a processer interconnected with each other.

The parser is configured to parse the inputted control signal. For example, when the value of the inputted control signal k is (00)₂, the parser will notify the processor to implement the standard basis multiplication of three operands over GF(2^(n)); when the value of the inputted control signal k is (01)₂, the parser will notify the processor to implement the look-up table multiplication of three operands over GF(2^(n)); when the value of the inputted control signal k is (10)₂, the parser will notify the processor to implement the standard basis multiplication of three operands over GF((2^(n))²); when the value of the inputted control signal k is (11)₂, the parser will notify the processor to implement the look-up table multiplication of three operands over GF((2^(n))²).

The processor is configured to receive the inputted control signal, and to notify the function components to implement corresponding functions based on the parsing results of the parser. For example, if the parsing result indicates that it is necessary to implement the standard basis multiplication of three operands over GF(2^(n)), then the processor will send a(x), b(x), c(x) and p(x) to the GF(2^(n)) standard basis multiplier and wait for feedback; once the feedback result is obtained, the processor will send the result to the output port d. If the parsing result indicates that it is necessary to implement the look-up table multiplication of three operands over GF(2^(n)), then the processor will send a(x), b(x), c(x) and p(x) to the GF(2^(n)) look-up table multiplier and wait for feedback; once the feedback result is obtained, the processor will send the result to the output port d. If the parsing result indicates that it is necessary to implement the standard basis multiplication of three operands over GF((2^(n))²), or the look-up table multiplication of three operands over GF((2^(n))²), then the processor will send a(x), b(x), c(x), p(x) and q(x) to the GF((2^(n))²) multiplier and wait for feedback; once the feedback result is obtained, the processor will send the result to the output port d.

(4) The GF((2^(n))²) multiplier: as illustrated in FIG. 3, the GF((2^(n))²) multiplier includes a processor and a scheduler interconnected with each other; the processor is configured to implement the multiplication (a(x)×b(x)×c(x))mod(q(x)) of three operands over GF((2^(n))²), and the scheduler is configured to call the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier. The processor uses an XOR gate circuit to obtain the calculation results when processing the addition operation over the GF(2^(n)) field. While processing the multiplication (k_(i)(x)·k_(j)(x)·k_(m)(x))mod(p(x)) over the GF(2^(n)) field, the scheduler calls the GF(2^(n)) look-up table multiplier or GF(2^(n)) standard basis multiplier to obtain the calculation results.

(5) The GF(2^(n)) standard basis multiplier: as illustrated in FIG. 4, the GF(2^(n)) standard basis multiplier includes a internal processor configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) on a standard basis over GF(2^(n)). The standard basis multiplication of the three operands a(x), b(x) and c(x) over GF(2^(n)) includes the steps of:

(5-1) Calculating v_(ij) based on

${{x^{i}{{{mod}p}(x)}} = {\sum\limits_{j = 0}^{n - 1}{v_{ij}x^{j}}}},$ wherein i=0, 1, . . . , 3(n−1), j=0, 1, . . . , n−1.

(5-2) Calculating S, based on

${S_{i} = {\sum\limits_{{j + k + l} = 1}{a_{j}b_{k}c_{l}}}},$ wherein i=0, 1, . . . , 3(n−1).

(5-3) Calculating d_(i) based on

${d_{i} = {\sum\limits_{j = 0}^{3{({n - 1})}}{v_{ji}S_{j}}}},$ wherein i=0, 1, . . . , n−1.

(5-4) Let

${{d(x)} = {\sum\limits_{i = 0}^{n - 1}{d_{i}x^{i}}}},$ then d(x) is the product of the three operands a(x), b(x) and c(x) over GF(2^(n)), and d(x) is also an element of GF(2^(n)).

(6) The GF(2^(n)) look-up table multiplier: the GF(2^(n)) look-up table multiplier is configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) over GF(2^(n)). As illustrated in FIG. 5, the look-up table multiplier includes a processor and a GF(2^(n)) look-up table interconnected with each other.

The GF(2^(n)) look-up table is constructed according to the following principle. There are 2^(n) elements of GF(2^(n)) in total. Assuming that a is a primitive root of GF(2^(n)), then each nonzero element of GF(2^(n)) may be expressed as an exponentiation of α, i.e. as an element in {α⁰, α¹, . . . , α² ^(n) ⁻²}. Assuming that k_(i)(x) is an element of GF(2^(n)), and may be expressed as α^(i), then {i, k_(i)(x)} is saved into the look-up table. When calculating (k_(i)(x)·k_(j)(x)·k_(m)(x))mod(p(x)), the internal processor only needs to look up the exponentiations of a corresponding to k_(i)(x), k_(j)(x), k_(m)(x), i.e. i, j, m by searching in the constructed look-up table. Next, the value u of (i+j+m)mod(2^(n)−1) is calculated. Lastly, an element k_(u)(x) of GF(2^(n)) corresponding to α^(u) is looked up by searching in the constructed look-up table. Thus, k_(u)(x) is the result of (k_(i)(x)·k_(j)(x)·k_(m)(x))mod(p(x)).

Working procedure of the multiplier of the present invention is now further described taking the example of n=4.

Let the control signal k be (00)₂, the parser of the controller notifies the processor of the controller to implement the standard basis multiplication of three operands over GF(2⁴). The processor of the controller receives the inputted data signals a(x), b(x), c(x) and p(x). As the three operands, a(x), b(x) and c(x) have the following forms: a(x)=a₃x³+a₂x²+a₁x+a₀, b(x)=b₃x³+b₂x²+b₁x+b₀ and c(x)=c₃x³+c₂x²+c₁x+c₀, all of which are elements of GF(2⁴); p(x) has a fixed inputting form: p(x)=x⁴+p₃x³+p₂x²+p₁x+1, and it is an irreducible polynomial selected over GF(2⁴). a₃, a₂, a₁, a₀, b₃, b₂, b₁, b₀, c₃, c₂, c₁, c₀ and p₃, p₂, p₁ are all elements of GF(2).

The processor of the controller sends a(x), b(x), c(x) and p(x) to the GF(2^(n)) standard basis multiplier and waits for feedback results. At this time, the GF(2^(n)) standard basis multiplier starts its processor, and implements the multiplication of three operands over GF(2^(n)), with the process as follows:

calculating v_(ij) based on

${{x^{i}{mod}\;{p(x)}} = {\sum\limits_{j = 0}^{3}{v_{ij}x^{j}}}},$ wherein i=0, 1, . . . , 9, j=0, 1, . . . , 3;

calculating S, based on

${S_{i} = {\sum\limits_{{j + k + l} = i}{a_{j}b_{k}c_{l}}}},$ wherein i=0, 1, . . . , 9;

calculating d_(i) based on

${d_{i} = {\sum\limits_{j = 0}^{9}{v_{ji}S_{j}}}},$ wherein i=0, 1, . . . , 3.

$\sum\limits_{i = 0}^{3}{d_{i}x^{i}}$ is the product of three operands over GF(2⁴), and the GF(2^(n)) standard basis multiplier sends this result to the controller; the controller sends the result to the output port d.

Let the control signal k be (01)₂, the parser of the controller notifies the processor of the controller to implement the look-up table multiplication of three operands over GF(2^(n)). The processor of the controller receives the inputted data signals a(x), b(x), c(x) and p(x). As the three operands, a(x), b(x) and c(x) have the following forms: a(x)=a₃x³+a₂x²+a₁x+a₀, b(x)=b₃x³+b₂x²+b₁x+b₀ and c(x)=c₃x³+c₂x²+c₁x+c₀, all of which are elements of GF(2⁴); p(x) has a fixed inputting form: p(x)=x⁴+p₃x³+p₂x²+p₁x+1, and it is an irreducible polynomial selected over GF(2⁴). a₃, a₂, a₁, a₀, b₃, b₂, b₁, b₀, c₃, c₂, c₁, c₀ and p₃, p₂, p₁ are all elements of GF(2).

The processor of the controller sends a(x), b(x), c(x) and p(x) to the GF(2^(n)) look-up table multiplier and waits for feedback results. The GF(2^(n)) look-up table multiplier starts its processor, and implements the multiplication of three operands over GF(2^(n)), with the detailed process as follows:

The processor of the GF(2^(n)) look-up table multiplier constructs the GF(2⁴) look-up table according to the following principle. There are sixteen elements in GF(2⁴) in total. Assuming that α is a primitive root of GF(2⁴), then each nonzero element of GF(2⁴) may be expressed as an exponentiation of α, i.e. as an element of {α⁰, α¹, . . . , α¹⁴}. Assuming that k_(i)(x) is an element of GF(2⁴), and may be expressed as α^(i), then {i, k_(i)(x)} is saved into the look-up table.

When the processor of the GF(2^(n)) look-up table multiplier is calculating (k_(i)(x)·k_(j)(x)·k_(m)(x))mod(p(x)), the exponentiations of α respectively corresponding to k_(i)(x), k_(j)(x), k_(m)(x), i.e. i, j, m, are looked up by searching in the constructed look-up table. Next, the value u of (i+j+m)mod(15) is calculated. Lastly, an element k_(u)(x) corresponding to α^(u) in GF(2⁴) is looked up by searching in the look-up table. Thus, k_(u)(x) is the result of (k_(i)(x)·k_(j)(x)·k_(m)(x))mod(p(x)). The GF(2^(n)) look-up table multiplier sends the calculation result to the controller, and the controller outputs this result into the output port d.

Let the control signal k be (10)₂ or (11)₂, the parser of the controller notifies the processor of the controller to implement the standard basis multiplication or the look-up table multiplication of three operands over GF((2^(n))²). The processor of the controller receives the inputted data signals a(x), b(x), c(x), p(x) and q(x). As the three operands, a(x), b(x) and c(x) have the following forms: a(x)=a_(h)x+a_(l), b(x)=b_(h)x+b_(l) and c(x)=c_(h)x+c_(l), all of which are elements of GF((2⁴)²); a_(h), a_(l), b_(h), b_(l), c_(h) and c_(l) are all elements of the GF(2⁴) finite field; p(x) and q(x), as the inputted data signals, are irreducible polynomials selected over GF(2⁴) and GF((2⁴)²), and have the following forms: p(x)=x⁴+x+1 and q(x)=x²+x+e, wherein e=9 is a constant of GF(2⁴).

The processor of the controller sends a(x), b(x), c(x), p(x) and q(x) to the GF((2^(n))²) multiplier, and waits for the feedback result. At this time, the GF((2^(n))²) multiplier starts its processor, and implement the multiplication of three operands over GF((2^(n))²), calculating respectively: d _(h) =e·a _(h) ·b _(h) ·c _(h) +a _(h) ·b _(h) ·c _(h) +a _(h) ·b _(l) ·c _(h) +a _(l) ·b _(h) ·c _(h) +a _(h) ·b _(h) ·c _(l) +a _(l) ·b _(l) ·c _(h) +a _(h) ·b _(l) ·c _(l) +a _(l) ·b _(h) ·c _(l) ,d _(l) =e(a _(h) ·b _(h) ·c _(h) +a _(h) ·b _(l) ·c _(h) +a _(l) ·b _(h) ·c _(h) +a _(h) ·b _(h) ·c _(l))+a _(l) ·b _(l) ·c _(l).

The operator · is the multiplication operation over the sub-field GF(2⁴), and the operator + is the addition operation over the sub-field GF(2⁴). When the processor of the GF((2^(n))²) multiplier is processing the multiplication operation over the sub-field GF(2⁴), it performs the calculation by starting the internal scheduler. At this time, the internal scheduler will need to send the three operands to the GF(2^(n)) standard basis multiplier or the GF(2^(n)) look-up table multiplier (i.e. sending to the GF(2^(n)) standard basis multiplier when k is (10)₂, and sending to the GF(2^(n)) look-up table multiplier when k is (11)₂), and wait for the feedback result. Once the GF(2^(n)) standard basis multiplier or the GF(2^(n)) look-up table multiplier has completed the necessary calculating and sent the result to the scheduler, the scheduler will immediately send the result to the processor of the GF((2^(n))²) multiplier. When the processor of the GF((2^(n))²) multiplier is processing the addition operation over the sub-field GF(2⁴), it obtains the calculating result by an XOR gate circuit. d(x)=d_(h)x+d_(l) is the calculating result of (a(x)×b(x)×c(x))mod(q(x)), and it is an element of GF((2⁴)²); d_(h) and d_(l) are elements of GF(2⁴). The internal processor sends the result to the controller, and the controller sends the result to the output port d.

The above embodiments are preferred embodiments of the present invention, which, however, is not intended to limit the implementation of the present invention. All of the variations, modifications, alternatives, combinations, simplifications that are not apart from the spirit of the invention shall be deemed as equivalences to those skilled in the art, and are within the protection scope of the present invention. 

What is claimed is:
 1. A composite finite field multiplier, comprising: an input port, configured to input an operand a(x), an operand b(x), an operand c(x), an irreducible polynomial p(x) selected over the GF(2^(n)) field, an irreducible polynomial q(x) selected over the GF((2^(n))^(m)) field and a control signal k; a GF(2^(n)) standard basis multiplier, configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) on the standard basis over GF(2^(n)); a GF(2^(n)) look-up table multiplier, configured to implement the multiplication (a(x)×b(x)×c(x))mod(p(x)) of the three operands a(x), b(x) and c(x) based on the look-up table over GF(2^(n)); a GF((2^(n))²) multiplier, comprising a first processor and a scheduler interconnected with each other; the first processor is configured to implement the multiplication (a(x)×b(x)×c(x))mod(q(x)) of the three operands a(x), b(x) and c(x) over GF((2^(n))²), when processing the addition operation over the GF(2^(n)) field, using an XOR gate circuit included in the first processor to obtain an intermediate calculation result, while when processing the multiplication over the GF(2^(n)) field, the scheduler calls the GF(2^(n)) look-up table multiplier or GF(2^(n)) standard basis multiplier to obtain an intermediate calculation result; a controller, configured to parse the control signal k and control the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier based on the parsing result; an output port, configured to output the results; wherein the controller is connected respectively to the input port, the output port, the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier; the GF((2^(n))²) multiplier is connected respectively to the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier.
 2. The composite finite field multiplier of claim 1, wherein the control signal k is a (2-bit) value, and has four types of binary value of (00)₂, (01)₂, (10)₂ and (11)₂.
 3. The composite finite field multiplier of claim 1, wherein the controller comprises a parser and a second processor interconnected with each other; the parser is configured to parse the inputted control signal; the second processor is configured to receive the data signal from the input port, and, according to a parsing result from the parser, to notify the GF((2^(n))²) multiplier, the GF(2^(n)) standard basis multiplier and the GF(2^(n)) look-up table multiplier to perform a function corresponding to the parsing result.
 4. The composite finite field multiplier of claim 1, wherein the operand a(x), operand b(x) and operand c(x) have the forms of: a(x)=a _(n-1) x ^(n-1) +a _(n-2) x ^(n-2) + . . . +a ₀; b(x)=b _(n-1) x ^(n-1) +b _(n-2) x ^(n-2) + . . . +b ₀; c(x)=c _(n-1) x ^(n-1) +c _(n-2) x ^(n-2) + . . . +c ₀.
 5. The composite finite field multiplier of claim 1, wherein the irreducible polynomial p(x) selected over the GF(2^(n)) field has the form of: p(x)=x ^(n) +p _(n-1) x ^(n-1) +p _(n-2) x ^(n-2) + . . . +p ₁ x+1.
 6. The composite finite field multiplier of claim 1, wherein the irreducible polynomial q(x) selected over the GF((2^(n))^(m)) field has the form of: q(x)=q _(m) x ^(m) +q _(m-1) x ^(m-1) + . . . +q ₀. 